Ear decomposition - PDFSEARCH.IO - Document Search Engine

Ear decomposition
Results: 86

#	Item
61	1 Optimality of Fast Matching Algorithms for Random Networks with Applications to Structural Controllability Mohamad Kazem Shirani Faradonbeh, Ambuj Tewari, and George Michailidis Add to Reading List Source URL: dept.stat.lsa.umich.edu Language: English - Date: 2016-04-09 11:17:17 Graph theory Mathematics Matroid theory Matching Combinatorial optimization Bipartite graph Maximum flow problem Degree Connectivity Ear decomposition HopcroftKarp algorithm Expander graph
62	Lecture 10: Graph Data Structures Steven Skiena Department of Computer Science State University of New York Stony Brook, NY 11794–4400 Add to Reading List Source URL: www3.cs.stonybrook.edu Language: English - Date: 2008-06-19 03:42:13 Graph theory Graph Directed graph Dense graph Ear decomposition Vertex Connected component Line graph Logic of graphs
63	MITSUBISHI ELECTRIC RESEARCH LABORATORIES http://www.merl.com A Complete and Effective Move Set for Simplified Protein Folding Add to Reading List Source URL: www.eecs.harvard.edu Language: English - Date: 2003-02-21 13:49:05 Graph theory Mathematics Graph connectivity Algorithm Mathematical logic Theoretical computer science Path Local search Ear decomposition Eulerian path
64	Variations on Random Graph Models for the Web Eleni Drinea Mihaela Enachescu Michael Mitzenmacher Add to Reading List Source URL: www.eecs.harvard.edu Language: English - Date: 2002-01-28 14:10:19 Mathematics Graph theory Discrete mathematics PageRank Vertex Graph Ear decomposition Almost surely Network science Centrality
65	Recovering Social Networks by Observing Votes Benjamin Fish and Yi Huang and Lev Reyzin Department of Mathematics, Statistics, & Computer Science University of Illinois at Chicago, Chicago, IL 60607 {bfish3,yihuang89,lre Add to Reading List Source URL: www.levreyzin.com Language: English - Date: 2015-12-18 15:57:04 Graph theory Bipartite graph Parity Graph Ear decomposition Matching NP-complete problems Graph coloring Line graph
66	b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs ∗ Flavia Bonomo1 , Oliver Schaudt2 , Maya Stein3 , and Mario Valencia-Pabon†4 1 Add to Reading List Source URL: www.zaik.uni-koeln.de Language: English - Date: 2014-02-09 09:55:11 Graph theory Graph coloring Matching NP-complete problems Combinatorial optimization Graph operations Blossom algorithm Bipartite graph Chordal graph Complete coloring Cograph Ear decomposition
67	Fixed-Parameter Tractability of Token Jumping on Planar Graphs arXiv:1406.6567v2 [cs.DM] 11 MarTakehiro Ito1 , Marcin Kami´ Add to Reading List Source URL: arxiv.org Language: English - Date: 2015-03-11 21:08:35 Graph theory NP-complete problems Planar graphs Independent set Graph Matching Ear decomposition Clique Bipartite graph Line graph Chordal graph
68	Region Counting Graphs Jean Cardinal∗ S´ebastien Collette† Abstract Add to Reading List Source URL: www.ulb.ac.be Language: English - Date: 2011-02-08 09:21:41 Graph theory Planar graph Graph property Forbidden graph characterization Graph minor Ear decomposition Random graph Planar separator theorem Matching
69	C:/Documents and Settings/mishaq01/Desktop/Mashhood/Conference Papers/COCOON 2009/camera ready/cocoon101a.dvi Add to Reading List Source URL: www.eecs.tufts.edu Language: English - Date: 2009-04-27 15:23:11 Graph theory Mathematics Graph operations Polygons Planar graphs Graph connectivity Dual graph Edge Graph Vertex Ear decomposition Bridge
70	September 20, :54 WSPC - Proceedings Trim Size: 9.75in x 6.5in Add to Reading List Source URL: www.jsbi.org Language: English - Date: 2008-01-07 20:56:23 Graph theory Mathematics Constraint programming Matroid theory Ear decomposition Graph Spanning tree Decomposition method Local consistency

UPDATE